☆
Why Is Maximum Clique Often Easy in Practice?
https://pubsonline.informs.org/doi/10.1287/opre.2019.1970
Authors: Jose L. Walteros, Austin Buchanan
Liked by: Maximimi
Domains: Graph algorithmics
Tags: LiMass
Uploaded by: Maximimi
Upload date: 2020-12-30 22:53:45
Edited at: 2020-12-30 23:07:09
Edited by: Maximimi

Comments:

- Open source implementation of the proposed algorithm: https://github.com/jwalteros/dOmega - Related question: [stackexchange](https://cstheory.stackexchange.com/questions/47947/linear-time-algorithm-to-test-if-clique-number-equals-degeneracy-bound)
Reply
Maximimi at 2020-12-30 23:05:01
Edited by Maximimi at 2020-12-30 23:33:33

Please consider to register or login to comment on the paper.